A Note on Uniquely H-colourable Graphs
نویسنده
چکیده
For a graph H, we compare two notions of uniquely H-colourable graphs, where one is defined via automorphisms, the second by vertex partitions. We prove that the two notions of uniquely H-colourable are not identical for all H, and we give a condition for when they are identical. The condition is related to the first homomorphism theorem from algebra.
منابع مشابه
A note on uniquely H-colorable graphs
For a graph H, we compare two notions of uniquely H-colourable graphs, where one is defined via automorphisms, the second by vertex partitions. We prove that the two notions of uniquely H-colourable are not identical for all H, and we give a condition for when they are identical. The condition is related to the first homomorphism theorem from algebra.
متن کاملUniquely circular colourable and uniquely fractional colourable graphs of large girth
Given any rational numbers r ≥ r′ > 2 and an integer g, we prove that there is a graph G of girth at least g, which is uniquely circular r-colourable and uniquely fractional r′-colourable. Moreover, the graph G has maximum degree bounded by a number which depends on r and r′ but does not depend on g.
متن کاملThe good, the bad, and the great: Homomorphisms and cores of random graphs
We consider homomorphism properties of a random graph G(n, p), where p is a function of n. A core H is great if for all e ∈ E(H), there is some homomorphism from H−e to H that is not onto. Great cores arise in the study of uniquely H-colourable graphs, where two inequivalent definitions arise for general cores H. For a large range of p, we prove that with probability tending to 1 as n → ∞, G ∈ ...
متن کاملUniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
For any integer k, we prove the existence of a uniquely k-colourable graph of girth at least g on at most k 12(g+1) vertices whose maximal degree is at most 5k 13. From this we deduce that, unless NP=RP, no polynomial time algorithm for k-Colourability on graphs G of girth g(G) log jGj 13 log k and maximum degree (G) 6k 13 can exist. We also study several related problems.
متن کاملThe existence of uniquely -G colourable graphs
Given graphs F and G and a nonnegative integer k, a function n : V(F) ~ {1 . . . . . k} is a G k-colouring of F if no induced copy of G is monochromatic; F is G k-chromatic if F has a G k-colouring but no G (k 1)-colouring. Further, we say F is uniquely G k-colourable if F is G k-chromatic and, up to a permutation of colours, it has only one G k-colouring. Such notions are extensions of the wel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006